Problems and Methods for Testing Infinite State Machines

Problems and Methods for Testing Infinite State Machines: Extended Abstract

There has been a lot of research on testing based on formal specifications, especially in the area of communication protocols. Most approaches take as starting point some finite model of the required behaviours of the system under test, such as Finite State Machines. This paper discusses the problems that arise when the underlying model of the specification is not finite.

Reachability Problems for Infinite State Systems

Decision problems for interacting finite state machines

Given a system of n interacting finite state machines (FSM’s) and a state configuration, the reachability problem is to examine whether this configuration is reachable within the system. We investigate the complexity of this decision problem and three of its derivatives, namely l) verifying system determinism, 2) testing for the existence of unspecified inputs to any FSM within the system, and ...

Reachability problems for communicating finite state machines

1. Introduction 2. Introductory examples 3. Communicating finite state machines 4. Reachability properties 5. Reachability analysis and abstract flow control 6. Affine SR-machines 7. Undecidable problems 8. Rational channels for cyclic protocols 9. Recognizable channels for general protocols 10. Abstract flow control in general graphs 11. Recapitulation and conclusions Appendix: Post's tag syst...

Abstract state machines: verification problems and complexity

State Machines: Verification Problems and Complexity Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westfälischen Technischen Hochschule Aachen zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertation vorgelegt von Diplom-Informatiker Marc Spielmann aus Duisburg Referent: Universitätsprofessor Dr. E. Grädel Koreferent...